Shortest-Elapsed-Time-First on a Multiprocessor
نویسندگان
چکیده
We show that SETF, the idealized version of the uniprocessor scheduling algorithm used by Unix, is scalable for the objective of fractional flow on a homogeneous multiprocessor. We also give a potential function analysis for the objective of weighted fractional flow on a uniprocessor.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملServer Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern that these algorithms may be insufficiently fair to individual jobs. The standard method for balancing average QoS and fairness is optimize the lp norm, 1 < p < ∞. Thus we consider server scheduling strategies to optimize the lp norms of the standard QoS measures, flow ...
متن کاملHash-Based Join Algorithms for Multiprocessor Computers with Shared Memory
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operation is proportional to the number of processors assigned to the operation and a global hash table is built in this shared memory. The concurrent update and access to this global hash table is studied. The elapsed time an...
متن کاملPetri net model of a dynamically partitioned multiprocessor system
A multiprocessor system can be subdivided into partitions of processors, each of which can be dedicated to the execution of a parallel program. The partitioning of the system can be done statically at system conngu-ration time, adaptively prior to the execution time, or dynamically during execution time. Since, in a dynamically partitioned multiprocessor system, partitioning can occur anytime d...
متن کاملT Task Scheduling using Performance Effective Genetic Algorithm for Parallel Heterogeneous System
The scheduling problem deals with the optimal assignment of a set of tasks onto parallel multiprocessor system and orders their execution so that the total completion time is minimized. The efficient execution of the schedule on parallel multiprocessor system takes the structure of the application and the performance characteristics of the proposed algorithm. Many heuristics and approximation a...
متن کامل